Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
نویسندگان
چکیده
منابع مشابه
The Multilinear Strong Maximal Function
A multivariable version of the strong maximal function is introduced and a sharp distributional estimate for this operator in the spirit of the Jessen, Marcinkiewicz, and Zygmund theorem is obtained. Conditions that characterize the boundedness of this multivariable operator on products of weighted Lebesgue spaces equipped with multiple weights are obtained. Results for other multi(sub)linear m...
متن کاملDeterministic Extractors for Algebraic Sources
An algebraic source is a random variable distributed uniformly over the set of common zeros of one or more multivariate polynomials defined over a finite field F. Our main result is the construction of an explicit deterministic extractor for algebraic sources over exponentially large prime fields. More precisely, we give an explicit (and arguably simple) function E : Fn 7→ {0, 1}m such that the...
متن کاملExtractors for Turing-Machine Sources
We obtain the first deterministic randomness extractors for n-bit sources with minentropy ≥ n1−α generated (or sampled) by single-tape Turing machines running in time n2−16α, for all sufficiently small α > 0. We also show that such machines cannot sample a uniform n-bit input to the Inner Product function together with the output. The proofs combine a variant of the crossing-sequence technique ...
متن کاملDeterministic Extractors for Additive Sources
We propose a new model of a weakly random source that admits randomness extraction. Our model of additive sources includes such natural sources as uniform distributions on arithmetic progressions (APs), generalized arithmetic progressions (GAPs), and Bohr sets, each of which generalizes affine sources. We give an explicit extractor for additive sources with linear minentropy over both Zp and Z ...
متن کاملNew Extractors for Interleaved Sources
We study how to extract randomness from a C-interleaved source, that is, a source comprised of C independent sources whose bits or symbols are interleaved. We describe a simple approach for constructing such extractors that yields: • For some δ > 0, c > 0, explicit extractors for 2-interleaved sources on {0, 1} when one source has min-entropy at least (1 − δ)n and the other has min-entropy at l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2011
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2010.06.013